package com.leetcode;

/**
 * 35. 搜索插入位置
 * 迭代法(另一种写法)
 *
 * @author fy
 * @date 2022/4/19 18:53
 */
public class Solution35_2 {

    public int searchInsert(int[] nums, int target) {
        int n = nums.length;
        int left = 0;
        int right = n - 1;
        int res = n;
        while (left <= right) {
            int mid = left + ((right - left) >> 1);
            if (nums[mid] >= target) {
                res = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return res;
    }

}
